منابع مشابه
Normalized Completion Revisited
Normalized completion (Marché 1996) is a widely applicable and efficient technique for completion modulo theories. If successful, a normalized completion procedure computes a rewrite system that allows to decide the validity problem using normalized rewriting. In this paper we consider a slightly simplified inference system for finite normalized completion runs. We prove correctness, show faith...
متن کاملDifferentially Private Matrix Completion, Revisited
We study the problem of privacy-preserving collaborative filtering where the objective is to reconstruct the entire users-items preference matrix using a few observed preferences of users for some of the items. Furthermore, the collaborative filtering algorithm should reconstruct the preference matrix while preserving the privacy of each user. We study this problem in the setting of joint diffe...
متن کاملPushing revisited: Differential flatness, trajectory planning and stabilization
We prove that quasi-static pushing with a sticking contact and ellipsoid approximation of the limit surface is differentially flat. Both graphical and algebraic derivations are given. A major conclusion is the pusher-slider system is reducible to the Dubins car problem where the sticking contact constraints translate to bounded curvature. Planning is as easy as computing Dubins curves with the ...
متن کاملCompletion-of-squares: Revisited and extended
Due to its simplicity, the completion-of-squares technique is quite popular in linear optimal control. However, this simple technique is limited to linear quadratic Gaussian systems. In this note, by interpreting the completion-ofsquares from a new angle, we extend this technique to performance optimization of general Markov systems with the long run average criterion, leading to a new approach...
متن کاملOn-line scheduling to minimize average completion time revisited
We consider the scheduling problem of minimizing the average-weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith’s ratio rule yield smaller competitive ratios than the previously best-known deterministic on-line algorithms. c © 2003 Elsevier B.V. All righ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebras and Representation Theory
سال: 2017
ISSN: 1386-923X,1572-9079
DOI: 10.1007/s10468-017-9735-7